Identification of stochastic finite-state systems
نویسندگان
چکیده
منابع مشابه
Stochastic finite-state systems in control theory
This paper is concerned, in the main, with a problem of pursuit–evasion in the context of a stochastic finite-state system. Two cases are considered: (a) non-competitive pursuit in which the target does not try to evade the pursuer; and (b) a competitive case in which the aim of the target is to maximize the time of interception, and that of the pursuer is to minimize it. Employing dynamic prog...
متن کاملOn the Loop-Free Decomposition of Stochastic Finite-State Systems
Two generalizations of Bacon's theory of loop-free decomposition of probabilistic finite-state systems are proposed. The first of these consists of a modification of the structure of the decomposition which then allows for the decomposition of a larger class of systems. The second generalization subsumes the first: sufficient conditions for a stochastic finite-state system to be decomposable fo...
متن کاملState-Identification Problems for Finite-State Transducers
A well-established theory exists for testing finite-state machines, in particular Moore and Mealy machines. A fundamental class of problems handled by this theory is state identification: we are given a machine with known state space and transition relation but unknown initial state, and we are asked to find experiments which permit to identify the initial or final state of the machine, called ...
متن کاملFinite - State Concurrent Systems ?
Temporal logic model checking is an automatic technique for verifying nite-state concurrent systems. Speciications are expressed in a propositional temporal logic, and the concurrent system is modeled as a state-transition graph. An eecient search procedure is used to determine whether or not the state-transition graph sat-isses the speciication. When the technique was rst developed ten years a...
متن کاملImplementation Relations for Stochastic Finite State Machines
We present a timed extension of the classical finite state machines model where time is introduced in two ways. On the one hand, timeouts can be specified, that is, we can express that if an input action is not received before a fix amount of time then the machine will change its state. On the other hand, we can associate time with the performance of actions. In this case, time will be given by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1972
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(72)90010-1